Point counting on Picard curves in large characteristic
نویسندگان
چکیده
We present an algorithm for computing the cardinality of the Jacobian of a random Picard curve over a finite field. If the underlying field is a prime field Fp, the algorithm has complexity O( √ p).
منابع مشابه
One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملCounting Points on Genus 2 Curves with Real Multiplication
We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite field Fq of large characteristic from Õ(log q) to Õ(log q). Using our algorithm we compute a 256-bit prime-order Jacobian, suitable for cryptographic applica...
متن کاملA General Framework for p–adic Point Counting and Application to Elliptic Curves on Legendre Form
In 2000 T. Satoh gave the first p–adic point counting algorithm for elliptic curves over finite fields. Satoh’s algorithm was followed by the SST algorithm and furthermore by the AGM and MSST algorithms for characteristic two only. All four algorithms are important to Elliptic Curve Cryptography. In this paper we present a general framework for p–adic point counting and we apply it to elliptic ...
متن کاملConstructing Rational Curves on K3 Surfaces
We develop a mixed-characteristic version of the MoriMukai technique for producing rational curves on K3 surfaces. We reduce modulo p, produce rational curves on the resulting K3 surface over a finite field, and lift to characteristic zero. As an application, we prove that all complex K3 surfaces with Picard group generated by a class of degree two have an infinite number of rational curves.
متن کاملSatoh ' S Algorithm in Characteristic 2 Berit
We give an algorithm for counting points on arbitrary ordinary elliptic curves over finite fields of characteristic 2, extending the O(log q) method given by Takakazu Satoh, giving the asymptotically fastest point counting algorithm known to date.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 74 شماره
صفحات -
تاریخ انتشار 2005